Streaming adaptive submodular maximization

نویسندگان

چکیده

Adaptive submodular maximization has been extensively studied in the literature. However, most of existing studies this field focus on pool-based setting, where one is allowed to pick items any order, and there have few for stream-based setting arrive an arbitrary order must immediately decide whether select item or not upon its arrival. In paper, we introduce a new class utility functions, semi-policywise functions. We develop series effective algorithms maximize function under setting.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Streaming Algorithms for Submodular Function Maximization

We consider the problem of maximizing a nonnegative submodular set function f : 2N → R+ subject to a p-matchoid constraint in the single-pass streaming setting. Previous work in this context has considered streaming algorithms for modular functions and monotone submodular functions. The main result is for submodular functions that are non-monotone. We describe deterministic and randomized algor...

متن کامل

Non-Monotone Adaptive Submodular Maximization

A wide range of AI problems, such as sensor placement, active learning, and network influence maximization, require sequentially selecting elements from a large set with the goal of optimizing the utility of the selected subset. Moreover, each element that is picked may provide stochastic feedback, which can be used to make smarter decisions about future selections. Finding efficient policies f...

متن کامل

Adaptive Submodular Maximization in Bandit Setting

Maximization of submodular functions has wide applications in machine learning and artificial intelligence. Adaptive submodular maximization has been traditionally studied under the assumption that the model of the world, the expected gain of choosing an item given previously selected items and their states, is known. In this paper, we study the setting where the expected gain is initially unkn...

متن کامل

Adaptive Submodular Influence Maximization with Myopic Feedback

In this paper, we study the problem of adaptive influence maximization in social networks. It has been proved that if the problem satisfies the adaptive submodularity property, then an adaptive greedy policy is guaranteed to provide an (1 − 1/e)-approximation of the optimal policy. Nevertheless, so far such a property has only been verified in the case of the full-adoption feedback model. As ad...

متن کامل

Do Less, Get More: Streaming Submodular Maximization with Subsampling

In this paper, we develop the first one-pass streaming algorithm for submodular maximization that does not evaluate the entire stream even once. By carefully subsampling each element of data stream, our algorithm enjoys the tightest approximation guarantees in various settings while having the smallest memory footprint and requiring the lowest number of function evaluations. More specifically, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2023

ISSN: ['1879-2294', '0304-3975']

DOI: https://doi.org/10.1016/j.tcs.2022.11.030